Extracting large quasi-bicliques using a skeleton-based heuristic

نویسندگان

  • Nick Pappas
  • David Fernandez-Baca
  • Ryan Martin
  • Giora Slutzki
  • Sabine Baumann
چکیده

............................................................................................................ iv Chapter 1 Introduction 1.1 Motivation ......................................................................................... 1 1.2 Preliminaries, notation, terminology and definitions ........................ 4 1.3 Quasi – biclique literature review...................................................... 6 1.3.1 γ quasi bicliques...................................................................... 6 1.3.2 (non symmetrical) ε quasi bicliques ........................................ 8 1.3.3 α quasi bicliques ................................................................... 10 1.3.4 error tolerant ε – quasi bicliques ............................................ 11 1.3.5 δ quasi bicliques ................................................................... 13 1.3.6 αβ – weighted quasi bicliques ................................................ 14 Chapter 2 αβ – weighted quasi bicliques web application .............................. 17 2.1 The ILP implementation status ........................................................ 17 2.2 The application ................................................................................ 19 2.2.1 Tools ....................................................................................... 20 2.2.2 User Guide .............................................................................. 21 Chapter 3 Skeleton based heuristic................................................................. 27 3.1 Motivation for the skeleton based heuristic..................................... 27 3.2 Skeleton preliminaries ...................................................................... 28

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-bicliques: Complexity and Binding Pairs

Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to find interacting protein group pairs from large PPI networks at the first step, and then to search conserved motifs within the protein groups to form interacting motif pairs. To consider noise effect and incompleteness of biolog...

متن کامل

Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications

The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques have been proposed to tackle this problem, however their noise tolerance is usually unbalanced and can be very skewed. In this paper, we improve the noise tolerance of maximal quasi-bicliques by allowing every vertex to ...

متن کامل

Mining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein networks

Several real world applications require mining of bicliques, as they represent correlated pairs of data clusters. However, the mining quality is adversely affected by missing and noisy data. Moreover, some applications only require strong interactions between data members of the pairs, but bicliques are pairs that display complete interactions. We address these two limitations by proposing maxi...

متن کامل

Detecting Bicliques in GF[q]

We consider the problem of finding planted bicliques in random matrices over GF [q]. That is, our input matrix is a GF [q]-sum of an unknown biclique (rank-1 matrix) and a random matrix. We study different models for the random graphs and characterize the conditions when the planted biclique can be recovered. We also empirically show that a simple heuristic can reliably recover the planted bicl...

متن کامل

Extracting Dynamics Matrix of Alignment Process for a Gimbaled Inertial Navigation System Using Heuristic Dynamic Programming Method

In this paper, with the aim of estimating internal dynamics matrix of a gimbaled Inertial Navigation system (as a discrete Linear system), the discretetime Hamilton-Jacobi-Bellman (HJB) equation for optimal control has been extracted. Heuristic Dynamic Programming algorithm (HDP) for solving equation has been presented and then a neural network approximation for cost function and control input ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015